Static Analysis of Predicate-based Synchronisation

نویسندگان

  • Mikhail Prokharau
  • Daniel Gerlach
  • Steffen Keul
چکیده

While many software projects requiring some form of parallelisation resort to standard synchronisation mechanisms offered by a programming language or a standard library of choice, other synchronisation techniques exist. This paper presents predicate-based synchronisation constructs and discusses the possibilities of their detection and static analysis.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Verification of Component-Based Systems via Predicate Abstraction and Simultaneous Set Reduction

This paper presents a novel safety property verification approach for component-based systems modelled in BIP (Behaviour, Interaction and Priority), encompassing multiparty synchronisation with data transfer and priority. Our contributions consist of: (1) an on-the-fly lazy predicate abstraction technique for BIP; (2) a novel explicit state reduction technique, called simultaneous set reduction...

متن کامل

Analysis of synchronisation patterns in stateful active objects

This paper presents a static analysis technique based on effect and behavioural types for deriving synchronisation patterns of stateful active objects and verifying their safety – e.g. absence of deadlocks. This is challenging because active objects use futures to refer to results of pending asynchronous invocations and because these futures can be stored in object fields, passed as method para...

متن کامل

Axiomatic Frameworks for Developing Bsp-style Programs*

In BSP a superstep comprises a collection of concurrently executed processes with initial and terminal synchronisations. Data transfer between processes is realised through asynchronous communications. BSP programs can be organised either as explicit compositions of supersteps or as parallel compositions of threads (processes) which include synchronisation alignment operations. In this paper ax...

متن کامل

Sparse Analysis of Variable Path Predicates Based upon SSA-Form

Static Single Assignment Form benefits data flow analysis by its static guarantees on the definitions and uses of variables. In this paper, we show how to exploit these guarantees to enable a sparse data flow analysis of variable predicates, for gaining a rich predicate-based and path-oriented characterization of a program’s variables’ values.

متن کامل

Static Analysis of Value-Passing Process Calculi

Standard approaches to providing a semantics for value passing process calculi involve an expansion into a basic calculus which only involves pure synchroni-sation. When the semantics is intended to provide a basis for static analysis of properties of the values, this expansion leads to an unacceptable loss of information. In this paper we present a model of value passing process calculi based ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Softwaretechnik-Trends

دوره 31  شماره 

صفحات  -

تاریخ انتشار 2011